Quadratic Convergence of Newton’s Method for Convex Interpolation and Smoothing
نویسندگان
چکیده
In this paper, we prove that Newton’s method for convex best interpolation is locally q-quadratically convergent, giving an answer to a question of Irvine, Marine and Smith [7] and strengthening a result of Andersson and Elfving [1] and our previous work [5]. A damped Newton-type method is presented which has global q-quadratic convergence. Analogous results are obtained for the convex smoothing problem. Numerical examples are presented.
منابع مشابه
Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming
In this paper, we propose a feasible interior-point method for convex quadratic programming over symmetric cones. The proposed algorithm relaxes the accuracy requirements in the solution of the Newton equation system, by using an inexact Newton direction. Furthermore, we obtain an acceptable level of error in the inexact algorithm on convex quadratic symmetric cone programmin...
متن کاملArmijo Newton method for convex best interpolation
More than a decade agao, Newton’s method has been proposed for constructing the convex best interpolant. Its local quadratic convergence has only been established recently by recasting it as the generalized Newton method for semismooth equations. It still remains mysterious that the Newton method coupled with line search strategies works practically well in global sense. Similar to the classica...
متن کاملA Note on Globally Convergent Newton Method for Strongly Monotone Variational Inequalities
Newton’s method for solving variational inequalities is known to be locally quadratically convergent. By incorporating a line search strategy for the regularized gap function, Taji et al. (Mathematical Programming, 1993) have proposed a modification of a Newton’s method which is globally convergent and whose rate of convergence is quadratic. But the quadratic convergence has been shown only und...
متن کاملA Novel Inexact Smoothing Method for Second-Order Cone Complementarity Problems
A novel inexact smoothing method is presented for solving the second-order cone complementarity problems (SOCCP). Our method reformulates the SOCCP as an equivalent nonlinear system of equations by introducing a regularized Chen-Harker-Kanzow-Smale smoothing function. At each iteration, Newton’s method is adopted to solve the system of equations approximately, which saves computation work compa...
متن کاملMath 2400 Lecture Notes: Differential Miscellany
1. L’Hôpital’s Rule 1 1.1. The Cauchy Mean Value Theorem 1 1.2. L’Hôpital’s Rule 2 2. Newton’s Method 5 2.1. Introducing Newton’s Method 5 2.2. A Babylonian Algorithm 6 2.3. Questioning Newton’s Method 7 2.4. Introducing Infinite Sequences 7 2.5. Contractions and Fixed Points 8 2.6. Convergence of Newton’s Method 10 2.7. Quadratic Convergence of Newton’s Method 11 2.8. An example of nonconverge...
متن کامل